Energy Efficient Buffer Cache Replacement

نویسندگان

  • Jianhui Yue
  • Yifeng Zhu
  • Zhao Cai
چکیده

Power consumption is an increasingly impressing concern for data servers as it directly affects running costs and system reliability. Prior studies have shown most memory space on data servers are used for buffer caching and thus cache replacement becomes critical. This paper investigates the tradeoff between these two interacting factors and proposes three energy-aware buffer cache replacement algorithm. On a cache miss for a new block b in a file f , it evicts an victim block from the most recently accessed memory chip. Simulation results based real-world TPC-R I/O trace show that our algorithm can save up to 12.2% energy with marginal degradation in hit rates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NBM: An Efficient Cache Replacement Algorithm for Nonvolatile Buffer Caches

Recently, byte-accessible NVRAM (nonvolatile RAM) technologies such as PRAM and FeRAM are advancing rapidly and there are attempts to use these NVRAMs as part of buffer caches. A nonvolatile buffer cache provides improved consistency of file systems by absorbing write I/Os as well as improved performance. In this paper, we discuss the optimality of cache replacement algorithms in nonvolatile bu...

متن کامل

Towards a More Efficient Trace Cache

Abstract— If the trace cache size is not large enough to contain all of the basic blocks of running application, a judicious hit and replacement logic becomes very important. This report proposes a weight-based technique to select the victim line in trace cache for the replacement logic. It also presents a judicious line-fill buffer logic which is found to decrease the redundancy in the trace c...

متن کامل

LMRU: An Efficient Buffer Management Scheme for Large Sequential and Looping Reference Pattern Applications

The buffer cache management algorithm used by almost all operating systems is known as LRU(Least Recently Used). LRU is known to perform well in applications with irregular reference pattern. However, it shows poor performance for sequential-pattern or looping-pattern applications with large-size data. For sequential or looping reference pattern, MRU(Most Recently Used) replacement policy is fr...

متن کامل

Reduction in Cache Memory Power Consumption based on Replacement Quantity

Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in cache memories. There is a direct relationship between power consumption and replacement quantity made in cache. The less the number of replacements is, the less...

متن کامل

Reduction in Cache Memory Power Consumption based on Replacement Quantity

Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in cache memories. There is a direct relationship between power consumption and replacement quantity made in cache. The less the number of replacements is, the less...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008